A Simple Method for Obtaining Primitive Pentanomials Over GF (2)
نویسندگان
چکیده
منابع مشابه
Multiples of Primitive Polynomials and Their Products over GF(2)
A standard model of nonlinear combiner generator for stream cipher system combines the outputs of several independent Linear Feedback Shift Register (LFSR) sequences using a nonlinear Boolean function to produce the key stream. Given such a model, cryptanalytic attacks have been proposed by finding out the sparse multiples of the connection polynomials corresponding to the LFSRs. In this direct...
متن کاملGF(2) bit-parallel squarer using generalised polynomial basis for new class of irreducible pentanomials
Introduction: The squarer is an important circuit building block in square-and-multiply-based exponentiation and inversion circuits. When GF(2) elements are represented in a normal basis, squaring is simply a circular shift operation. Therefore, most previous works on squarers focused on other representations of GF(2) elements. For practical applications where values of n are often in the range...
متن کاملNew primitive t-nomials (t = 3, 5) over GF(2) whose degree is a Mersenne exponent
All primitive trinomials over GF (2) with degree 859433 (which is the 33rd Mersenne exponent) are presented. They are X859433 +X288477 + 1 and its reciprocal. Also two examples of primitive pentanomials over GF (2) with degree 86243 (which is the 28th Mersenne exponent) are presented. The sieve used is briefly described.
متن کاملA Simple Method of Obtaining Anærobiosis
are placed at the bottom of the jar, one of the usual oxygen indicators (for example, alkali^6' glucose-methylene-blue mixture) placed aloflj? with the cultures, and the jar sealed. After jj to 12 hours, according to the size of the jar an" the amount and quality of iron filings, the colour of the indicator is discharged and co1*^ plete anaerobiosis obtained. Approximately " grammes of iron fil...
متن کاملLinear Circuits over GF(2)
For $n=2^k$, let $S$ be an $n x n$ matrix whose rows and columns are indexed by $GF(2)^k$ and, for $I,j \in GF(2)^k$, $S_{I,j}={I,j}$, the standard inner product. Size-depth trade-offs are investigated for computing $Sx$ with circuits using only linear operations. In particular, linear size circuits with depth bounded by the inverse of an Ackerman function are constructed, and it is shown that ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the Society of Instrument and Control Engineers
سال: 1982
ISSN: 0453-4654
DOI: 10.9746/sicetr1965.18.747